On the Power of Additive Combinatorial Search Model
نویسنده
چکیده
We consider two generic problems of combinatorial search under the additive model. The rst one is the problem of reconstructing boundeddweight vectors. We establish an optimal upper bound and observe that it uniies many known results for coinnweighing problems. The developed technique provides a basis for the graph reconstruction problem. Optimal upper bound is proven for the class of kdegenerate graphs.
منابع مشابه
Location and Capacity of UPFC to Improve the Operation Power System Using a Grasshopper Optimisation Algorithm
Unified Power Flow Controller (UPFC) is one of the most efficient FACTS devices that can be individually or combinatorial on all effective parameters in the transmission power of the transmission lines. With the flexibility of effective parameters in power passage, the power system operation can be improved. in this study, the optimization algorithm based on location and optimal capacity of UPF...
متن کاملApplication of Tabu Search to Optimal Placement of Distributed Generation and Reactive Power Sources
Introducing distributed generation into a power system can lead to numerous benefits including technical, economic, environmental, etc. To attain these benefits, distributed generators with proper rating should be installed at suitable locations. Given the similar effects of distributed generators and capacitor banks on operation indices of a distribution system, simultaneous assignment of best...
متن کاملApplication of Tabu Search to Optimal Placement of Distributed Generation and Reactive Power Sources
Introducing distributed generation into a power system can lead to numerous benefits including technical, economic, environmental, etc. To attain these benefits, distributed generators with proper rating should be installed at suitable locations. Given the similar effects of distributed generators and capacitor banks on operation indices of a distribution system, simultaneous assignment of best...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملLoad Model Effect Assessment on Optimal Distributed Generation Sizing and Allocation Using Improved Harmony Search Algorithm
The operation of a distribution system in the presence of distributed generation systems has someadvantages and challenges. Optimal sizing and siting of DG systems has economic, technical, andenvironmental benefits in distribution systems. Improper selection of DG systems can reduce theseadvantages or even result in deterioration in the normal operation of the distribution system. DGallocation ...
متن کامل